Generalized bilinear forms graphs and MDR codes over residue class rings
نویسنده
چکیده
We investigate the generalized bilinear forms graph Γd over a residue class ring Zps . We show that Γd is a connected vertex transitive graph, and completely determine its independence number, clique number, chromatic number and maximum cliques. We also prove that cores of both Γd and its complement are maximum cliques. The graph Γd is useful for error-correcting codes. We show that every largest independent set of Γd is both an MRD code over Zps and a usual MDS code. Moreover, there is a largest independent set of Γd to be a linear code over Zps .
منابع مشابه
Witt rings of quadratically presentable fields
This paper introduces an approach to the axiomatic theory of quadratic forms based on {tmem{presentable}} partially ordered sets, that is partially ordered sets subject to additional conditions which amount to a strong form of local presentability. It turns out that the classical notion of the Witt ring of symmetric bilinear forms over a field makes sense in the context of {tmem{quadratically p...
متن کاملGray Images of Constacyclic Codes over some Polynomial Residue Rings
Let be the quotient ring where is the finite field of size and is a positive integer. A Gray map of length over is a special map from to ( . The Gray map is said to be a ( )-Gray map if the image of any -constacyclic code over is a -constacyclic code over the field . In this paper we investigate the existence of ( )-Gray maps over . In this direction, we find an equivalent ...
متن کاملGeneralized Reed-Muller codes over Galois rings
Recently, Bhaintwal and Wasan studied the Generalized Reed-Muller codes over the prime power integer residue ring. In this paper, we give a generalization of these codes to Generalized Reed-Muller codes over Galois rings.
متن کاملComputing generators of groups preserving a bilinear form over residue class rings
We construct generators for symplectic and orthogonal groups over residue class rings modulo an odd prime power. These generators have been implemented and are available in the computer algebra system GAP.
متن کاملStructured LDPC Codes over Integer Residue Rings
This paper presents a new class of low-density parity-check (LDPC) codes over Z2a represented by regular, structured Tanner graphs. These graphs are constructed using Latin squares defined over a multiplicative group of a Galois ring, rather than a finite field. Our approach yields codes for a wide range of code rates and more importantly, codes whose minimum pseudocodeword weights equal their ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017